Spanning trails containing given edges
نویسندگان
چکیده
A graph G is Eulerian-connected if for any u and v in V (G), G has a spanning (u. v)-trail. A graph G is edge-Eulerian-connected if for any e' and elf in E(G), G has a spanning (e', elf)-trail. For an integer r ~ 0, a graph is called r-Eulerian-connected if for any X s::: E(G) with IXI ~r, and for any u, v E V(G), G has a spanning (u, v)-trail T such that X s::: E(T). The r-edge-Eulerian connectivity of a graph can be defined similarly. Let O(r) be the minimum value of k such that every k-edge-connected graph is r-Eulerian-connected. Catlin proved that 0(0) =4. We shall show that O(r) =4 for 0 ~ r ~ 2, and O(r) = r + 1 for r ~ 3. Results on r-edge-Eulerian connectivity are also discussed. © 2005 Elsevier B.V. All rights reserved.
منابع مشابه
Spanning trails in essentially 4-edge-connected graphs
A connected graphG is essentially 4-edge-connected if for any edge cut X ofGwith |X | < 4, either G − X is connected or at most one component of G − X has edges. In this paper, we introduce a reductionmethod and investigate the existence of spanning trails in essentially 4-edge-connected graphs. As an application, we prove that if G is 4-edge-connected, then for any edge subset X0 ⊆ E(G) with |...
متن کاملDominating sets whose closed stars form spanning trees
For a subset W of vertices of an undirected graph G, let S(W ) be the subgraph consisting of W , all edges incident to at least one vertex in W , and all vertices adjacent to at least one vertex in W . If there exists a W such that S(W ) is a tree containing all the vertices of G, then S(W ) is a spanning star tree of G. These and associated notions are related to connected and/or acyclic domin...
متن کاملSpanning Trails Connecting Given Edges
Suppose that F is the set of connected graphs such that a graph G 2 F if and only if G satisfies both (F1) if X is an edge cut of G with jX j 3, then there exists a vertex v of degree jX j such that X consists of all the edges incident with v in G, and (F2) for every v of degree 3, v lies in a k-cycle of G, where 2 k 3. In this paper, we show that if G 2 F and j0ðGÞ 3, then for every pair of ed...
متن کاملSpanning trails
A graph is called 2K2-free if it does not contain two independent edges as an induced subgraph. Mou and Pasechnik conjectured that every 3 2 -tough 2K2-free graph with at least three vertices has a spanning trail with maximum degree at most 4. In this paper, we confirm this conjecture. We also provide examples for all t < 54 of t-tough graphs that do not have a spanning trail with maximum degre...
متن کاملEnumerating Eulerian Trails Based on Line Graph Conversion
(Abstract) Given an undirected graph G, we consider enumerating all Eulerian trails, that is, walks containing each of the edges in G just once. We consider achieving it with the enumeration of Hamiltonian paths with the zero-suppressed decision diagram (ZDD), a data structure that can efficiently store a family of sets satisfying given conditions. First we compute the line graph L(G), the grap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 306 شماره
صفحات -
تاریخ انتشار 2006